Quantum Codes from Linear Codes over Finite Chain Rings
نویسندگان
چکیده
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-ShorSteane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring Fp2m + uFp2m. The good parameters of quantum codes from cyclic codes over finite chain rings are obtained.
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملLinear Codes over Finite Chain Rings
The aim of this paper is to develop a theory of linear codes over finite chain rings from a geometric viewpoint. Generalizing a well-known result for linear codes over fields, we prove that there exists a one-to-one correspondence between so-called fat linear codes over chain rings and multisets of points in projective Hjelmslev geometries, in the sense that semilinearly isomorphic codes corres...
متن کاملThe Gray Image of Codes over Finite Chain Rings
The results of J. F. Qian et al. [5] on (1 − γ)-constacyclic codes over finite chain rings of nilpotency index 2 are extended to (1 − γe)constacyclic codes over finite chain rings of arbitrary nilpotency index e+1. The Gray map is introduced for this type of rings. We prove that the Gray image of a linear (1− γe)-constacyclic code over a finite chain ring is a distance-invariant quasi-cyclic co...
متن کاملGilbert-Varshamov type bounds for linear codes over finite chain rings
We obtain finite and asymptotic Gilbert-Varshamov type bounds for linear codes over finite chain rings with various weights.
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information Processing
دوره 16 شماره
صفحات -
تاریخ انتشار 2017